<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>NumCpp: nc::stl_algorithms Namespace Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="NumCppLogoDoxygen.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">NumCpp
   &#160;<span id="projectnumber">2.1.0</span>
   </div>
   <div id="projectbrief">A C++ implementation of the Python Numpy library</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('namespacenc_1_1stl__algorithms.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#func-members">Functions</a>  </div>
  <div class="headertitle">
<div class="title">nc::stl_algorithms Namespace Reference</div>  </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a6c632e800fd350eb36ea01eb522eeb1f"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class UnaryPredicate &gt; </td></tr>
<tr class="memitem:a6c632e800fd350eb36ea01eb522eeb1f"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a6c632e800fd350eb36ea01eb522eeb1f">all_of</a> (InputIt first, InputIt last, UnaryPredicate p) noexcept</td></tr>
<tr class="separator:a6c632e800fd350eb36ea01eb522eeb1f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ae9c71c7298f83822ab49d270c867ba"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class UnaryPredicate &gt; </td></tr>
<tr class="memitem:a0ae9c71c7298f83822ab49d270c867ba"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a0ae9c71c7298f83822ab49d270c867ba">any_of</a> (InputIt first, InputIt last, UnaryPredicate p) noexcept</td></tr>
<tr class="separator:a0ae9c71c7298f83822ab49d270c867ba"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae62a4e197ec640aacea520220bd27cef"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class OutputIt &gt; </td></tr>
<tr class="memitem:ae62a4e197ec640aacea520220bd27cef"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#ae62a4e197ec640aacea520220bd27cef">copy</a> (InputIt first, InputIt last, OutputIt destination) noexcept</td></tr>
<tr class="separator:ae62a4e197ec640aacea520220bd27cef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1fa02155befc0c39a853e66f6df26745"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class T &gt; </td></tr>
<tr class="memitem:a1fa02155befc0c39a853e66f6df26745"><td class="memTemplItemLeft" align="right" valign="top">std::iterator_traits&lt; InputIt &gt;::difference_type&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a1fa02155befc0c39a853e66f6df26745">count</a> (InputIt first, InputIt last, const T &amp;value) noexcept</td></tr>
<tr class="separator:a1fa02155befc0c39a853e66f6df26745"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab200b92040bf3da8ee4325f5a994e73d"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 &gt; </td></tr>
<tr class="memitem:ab200b92040bf3da8ee4325f5a994e73d"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#ab200b92040bf3da8ee4325f5a994e73d">equal</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept</td></tr>
<tr class="separator:ab200b92040bf3da8ee4325f5a994e73d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a684d1011b375da4078afb4474a36b0e6"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class BinaryPredicate &gt; </td></tr>
<tr class="memitem:a684d1011b375da4078afb4474a36b0e6"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a684d1011b375da4078afb4474a36b0e6">equal</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) noexcept</td></tr>
<tr class="separator:a684d1011b375da4078afb4474a36b0e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af9a01fcb79e7a69b707081c1c17f361c"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class T &gt; </td></tr>
<tr class="memitem:af9a01fcb79e7a69b707081c1c17f361c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#af9a01fcb79e7a69b707081c1c17f361c">fill</a> (ForwardIt first, ForwardIt last, const T &amp;value) noexcept</td></tr>
<tr class="separator:af9a01fcb79e7a69b707081c1c17f361c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a761aa9f3bd88f019c46fe6cece93ade2"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class T &gt; </td></tr>
<tr class="memitem:a761aa9f3bd88f019c46fe6cece93ade2"><td class="memTemplItemLeft" align="right" valign="top">InputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a761aa9f3bd88f019c46fe6cece93ade2">find</a> (InputIt first, InputIt last, const T &amp;value) noexcept</td></tr>
<tr class="separator:a761aa9f3bd88f019c46fe6cece93ade2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a734698435eabdbc5bdf93b195d7fb6a7"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class UnaryFunction &gt; </td></tr>
<tr class="memitem:a734698435eabdbc5bdf93b195d7fb6a7"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a734698435eabdbc5bdf93b195d7fb6a7">for_each</a> (InputIt first, InputIt last, UnaryFunction f)</td></tr>
<tr class="separator:a734698435eabdbc5bdf93b195d7fb6a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aca7862e3fe066fc65bf00cb7f5108e33"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt &gt; </td></tr>
<tr class="memitem:aca7862e3fe066fc65bf00cb7f5108e33"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#aca7862e3fe066fc65bf00cb7f5108e33">is_sorted</a> (ForwardIt first, ForwardIt last) noexcept</td></tr>
<tr class="separator:aca7862e3fe066fc65bf00cb7f5108e33"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1f71dfda5f16d8a53c16260c5fa8fbdc"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class Compare &gt; </td></tr>
<tr class="memitem:a1f71dfda5f16d8a53c16260c5fa8fbdc"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a1f71dfda5f16d8a53c16260c5fa8fbdc">is_sorted</a> (ForwardIt first, ForwardIt last, Compare comp) noexcept</td></tr>
<tr class="separator:a1f71dfda5f16d8a53c16260c5fa8fbdc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a334cd50f7f10f689f82fa2ba7c5d88b2"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt &gt; </td></tr>
<tr class="memitem:a334cd50f7f10f689f82fa2ba7c5d88b2"><td class="memTemplItemLeft" align="right" valign="top">ForwardIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a334cd50f7f10f689f82fa2ba7c5d88b2">max_element</a> (ForwardIt first, ForwardIt last) noexcept</td></tr>
<tr class="separator:a334cd50f7f10f689f82fa2ba7c5d88b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a282a4146afe33e4abb012e5c6b332948"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class Compare &gt; </td></tr>
<tr class="memitem:a282a4146afe33e4abb012e5c6b332948"><td class="memTemplItemLeft" align="right" valign="top">ForwardIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a282a4146afe33e4abb012e5c6b332948">max_element</a> (ForwardIt first, ForwardIt last, Compare comp) noexcept</td></tr>
<tr class="separator:a282a4146afe33e4abb012e5c6b332948"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af6291d1011c61c416134bc28def6f3ac"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt &gt; </td></tr>
<tr class="memitem:af6291d1011c61c416134bc28def6f3ac"><td class="memTemplItemLeft" align="right" valign="top">ForwardIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#af6291d1011c61c416134bc28def6f3ac">min_element</a> (ForwardIt first, ForwardIt last) noexcept</td></tr>
<tr class="separator:af6291d1011c61c416134bc28def6f3ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acb252e962fc7cedee9f4257453480d2b"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class Compare &gt; </td></tr>
<tr class="memitem:acb252e962fc7cedee9f4257453480d2b"><td class="memTemplItemLeft" align="right" valign="top">ForwardIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#acb252e962fc7cedee9f4257453480d2b">min_element</a> (ForwardIt first, ForwardIt last, Compare comp) noexcept</td></tr>
<tr class="separator:acb252e962fc7cedee9f4257453480d2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a919ee9141ca95be989ad9b872a7ebd27"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt &gt; </td></tr>
<tr class="memitem:a919ee9141ca95be989ad9b872a7ebd27"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; ForwardIt, ForwardIt &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a919ee9141ca95be989ad9b872a7ebd27">minmax_element</a> (ForwardIt first, ForwardIt last) noexcept</td></tr>
<tr class="separator:a919ee9141ca95be989ad9b872a7ebd27"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae1007b77aafe5a99b4952d9a8d8307af"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class Compare &gt; </td></tr>
<tr class="memitem:ae1007b77aafe5a99b4952d9a8d8307af"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; ForwardIt, ForwardIt &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#ae1007b77aafe5a99b4952d9a8d8307af">minmax_element</a> (ForwardIt first, ForwardIt last, Compare comp) noexcept</td></tr>
<tr class="separator:ae1007b77aafe5a99b4952d9a8d8307af"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2804ccb14980f96c7680838adc3b2762"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class UnaryPredicate &gt; </td></tr>
<tr class="memitem:a2804ccb14980f96c7680838adc3b2762"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a2804ccb14980f96c7680838adc3b2762">none_of</a> (InputIt first, InputIt last, UnaryPredicate p) noexcept</td></tr>
<tr class="separator:a2804ccb14980f96c7680838adc3b2762"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af5ef45ab7814938799020ad24358b734"><td class="memTemplParams" colspan="2">template&lt;class RandomIt &gt; </td></tr>
<tr class="memitem:af5ef45ab7814938799020ad24358b734"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#af5ef45ab7814938799020ad24358b734">nth_element</a> (RandomIt first, RandomIt nth, RandomIt last) noexcept</td></tr>
<tr class="separator:af5ef45ab7814938799020ad24358b734"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9928869b550b082898709c5671936079"><td class="memTemplParams" colspan="2">template&lt;class RandomIt , class Compare &gt; </td></tr>
<tr class="memitem:a9928869b550b082898709c5671936079"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a9928869b550b082898709c5671936079">nth_element</a> (RandomIt first, RandomIt nth, RandomIt last, Compare comp) noexcept</td></tr>
<tr class="separator:a9928869b550b082898709c5671936079"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8d46043c9c62a348687ef8aa0a3286b"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt , class T &gt; </td></tr>
<tr class="memitem:aa8d46043c9c62a348687ef8aa0a3286b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#aa8d46043c9c62a348687ef8aa0a3286b">replace</a> (ForwardIt first, ForwardIt last, const T &amp;oldValue, const T &amp;newValue) noexcept</td></tr>
<tr class="separator:aa8d46043c9c62a348687ef8aa0a3286b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5334750b4a1bb38d3932bffcc32a71b4"><td class="memTemplParams" colspan="2">template&lt;class BidirIt &gt; </td></tr>
<tr class="memitem:a5334750b4a1bb38d3932bffcc32a71b4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a5334750b4a1bb38d3932bffcc32a71b4">reverse</a> (BidirIt first, BidirIt last) noexcept</td></tr>
<tr class="separator:a5334750b4a1bb38d3932bffcc32a71b4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acfc1538e29a04fe5158405c710e5eaa7"><td class="memTemplParams" colspan="2">template&lt;class ForwardIt &gt; </td></tr>
<tr class="memitem:acfc1538e29a04fe5158405c710e5eaa7"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#acfc1538e29a04fe5158405c710e5eaa7">rotate</a> (ForwardIt first, ForwardIt firstN, ForwardIt last) noexcept</td></tr>
<tr class="separator:acfc1538e29a04fe5158405c710e5eaa7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8cc83e2fb7a3d8302db0f4b19513ddd9"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </td></tr>
<tr class="memitem:a8cc83e2fb7a3d8302db0f4b19513ddd9"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a8cc83e2fb7a3d8302db0f4b19513ddd9">set_difference</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)</td></tr>
<tr class="separator:a8cc83e2fb7a3d8302db0f4b19513ddd9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8a145ff0f4cf32b64e7464347d1ea9b2"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </td></tr>
<tr class="memitem:a8a145ff0f4cf32b64e7464347d1ea9b2"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a8a145ff0f4cf32b64e7464347d1ea9b2">set_difference</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept</td></tr>
<tr class="separator:a8a145ff0f4cf32b64e7464347d1ea9b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8ff8c5bb6003ff0f02a17deb4ced8e2"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </td></tr>
<tr class="memitem:aa8ff8c5bb6003ff0f02a17deb4ced8e2"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#aa8ff8c5bb6003ff0f02a17deb4ced8e2">set_intersection</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept</td></tr>
<tr class="separator:aa8ff8c5bb6003ff0f02a17deb4ced8e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9a963ad13c86117f01fe2960525e074"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </td></tr>
<tr class="memitem:ad9a963ad13c86117f01fe2960525e074"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#ad9a963ad13c86117f01fe2960525e074">set_intersection</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept</td></tr>
<tr class="separator:ad9a963ad13c86117f01fe2960525e074"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a273ff7212f84bcd8de30e83ab0ae3bd1"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </td></tr>
<tr class="memitem:a273ff7212f84bcd8de30e83ab0ae3bd1"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a273ff7212f84bcd8de30e83ab0ae3bd1">set_union</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept</td></tr>
<tr class="separator:a273ff7212f84bcd8de30e83ab0ae3bd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a33da2f830ebf2e7c04f1ac94e1ad20b7"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </td></tr>
<tr class="memitem:a33da2f830ebf2e7c04f1ac94e1ad20b7"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a33da2f830ebf2e7c04f1ac94e1ad20b7">set_union</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept</td></tr>
<tr class="separator:a33da2f830ebf2e7c04f1ac94e1ad20b7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1d75d47f198fcc3693e87806d6ea8715"><td class="memTemplParams" colspan="2">template&lt;class RandomIt &gt; </td></tr>
<tr class="memitem:a1d75d47f198fcc3693e87806d6ea8715"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a1d75d47f198fcc3693e87806d6ea8715">sort</a> (RandomIt first, RandomIt last) noexcept</td></tr>
<tr class="separator:a1d75d47f198fcc3693e87806d6ea8715"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a519432fa55645fab8162c354e387b1a6"><td class="memTemplParams" colspan="2">template&lt;class RandomIt , class Compare &gt; </td></tr>
<tr class="memitem:a519432fa55645fab8162c354e387b1a6"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a519432fa55645fab8162c354e387b1a6">sort</a> (RandomIt first, RandomIt last, Compare comp) noexcept</td></tr>
<tr class="separator:a519432fa55645fab8162c354e387b1a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3b9f4bb9ba9a3ea8d8f97258eaa732d9"><td class="memTemplParams" colspan="2">template&lt;class RandomIt &gt; </td></tr>
<tr class="memitem:a3b9f4bb9ba9a3ea8d8f97258eaa732d9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a3b9f4bb9ba9a3ea8d8f97258eaa732d9">stable_sort</a> (RandomIt first, RandomIt last) noexcept</td></tr>
<tr class="separator:a3b9f4bb9ba9a3ea8d8f97258eaa732d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7b2c4b6a3ef5cc55ebdae2aa757d1874"><td class="memTemplParams" colspan="2">template&lt;class RandomIt , class Compare &gt; </td></tr>
<tr class="memitem:a7b2c4b6a3ef5cc55ebdae2aa757d1874"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a7b2c4b6a3ef5cc55ebdae2aa757d1874">stable_sort</a> (RandomIt first, RandomIt last, Compare comp) noexcept</td></tr>
<tr class="separator:a7b2c4b6a3ef5cc55ebdae2aa757d1874"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a616d5dabd547326285946d0014361ab4"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class OutputIt , class UnaryOperation &gt; </td></tr>
<tr class="memitem:a616d5dabd547326285946d0014361ab4"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a616d5dabd547326285946d0014361ab4">transform</a> (InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)</td></tr>
<tr class="separator:a616d5dabd547326285946d0014361ab4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af358fec5563ae500162b310fe263a36d"><td class="memTemplParams" colspan="2">template&lt;class InputIt1 , class InputIt2 , class OutputIt , class BinaryOperation &gt; </td></tr>
<tr class="memitem:af358fec5563ae500162b310fe263a36d"><td class="memTemplItemLeft" align="right" valign="top">OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#af358fec5563ae500162b310fe263a36d">transform</a> (InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt destination, BinaryOperation unaryFunction)</td></tr>
<tr class="separator:af358fec5563ae500162b310fe263a36d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7cec030870d1f3b4d1c7caf26c8d907d"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class OutputIt &gt; </td></tr>
<tr class="memitem:a7cec030870d1f3b4d1c7caf26c8d907d"><td class="memTemplItemLeft" align="right" valign="top">constexpr OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#a7cec030870d1f3b4d1c7caf26c8d907d">unique_copy</a> (InputIt first, InputIt last, OutputIt destination) noexcept</td></tr>
<tr class="separator:a7cec030870d1f3b4d1c7caf26c8d907d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aefa150cdbb6a1110c2164a3970a317a8"><td class="memTemplParams" colspan="2">template&lt;class InputIt , class OutputIt , class BinaryPredicate &gt; </td></tr>
<tr class="memitem:aefa150cdbb6a1110c2164a3970a317a8"><td class="memTemplItemLeft" align="right" valign="top">constexpr OutputIt&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacenc_1_1stl__algorithms.html#aefa150cdbb6a1110c2164a3970a317a8">unique_copy</a> (InputIt first, InputIt last, OutputIt destination, BinaryPredicate binaryFunction) noexcept</td></tr>
<tr class="separator:aefa150cdbb6a1110c2164a3970a317a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Function Documentation</h2>
<a id="a6c632e800fd350eb36ea01eb522eeb1f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6c632e800fd350eb36ea01eb522eeb1f">&#9670;&nbsp;</a></span>all_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class UnaryPredicate &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::all_of </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">UnaryPredicate&#160;</td>
          <td class="paramname"><em>p</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Tests if all of the elements of a range satisy a predicate</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">p</td><td>unary predicate function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool </dd></dl>

</div>
</div>
<a id="a0ae9c71c7298f83822ab49d270c867ba"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ae9c71c7298f83822ab49d270c867ba">&#9670;&nbsp;</a></span>any_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class UnaryPredicate &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::any_of </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">UnaryPredicate&#160;</td>
          <td class="paramname"><em>p</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Tests if any of the elements of a range satisy a predicate</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">p</td><td>unary predicate function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool </dd></dl>

</div>
</div>
<a id="ae62a4e197ec640aacea520220bd27cef"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae62a4e197ec640aacea520220bd27cef">&#9670;&nbsp;</a></span>copy()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class OutputIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::copy </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Copies from one container to another</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">destination</td><td>the first iterator of the destination </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a1fa02155befc0c39a853e66f6df26745"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1fa02155befc0c39a853e66f6df26745">&#9670;&nbsp;</a></span>count()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::iterator_traits&lt;InputIt&gt;::difference_type nc::stl_algorithms::count </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>value</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Counts the values in the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of container </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of container </td></tr>
    <tr><td class="paramname">value</td><td>the initial value </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>count </dd></dl>

</div>
</div>
<a id="ab200b92040bf3da8ee4325f5a994e73d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab200b92040bf3da8ee4325f5a994e73d">&#9670;&nbsp;</a></span>equal() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::equal </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Test if two ranges are equal</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of first container </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of first container </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of second container </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool </dd></dl>

</div>
</div>
<a id="a684d1011b375da4078afb4474a36b0e6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a684d1011b375da4078afb4474a36b0e6">&#9670;&nbsp;</a></span>equal() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class BinaryPredicate &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::equal </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">BinaryPredicate&#160;</td>
          <td class="paramname"><em>p</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Test if two ranges are equal</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of first container </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of first container </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of second container </td></tr>
    <tr><td class="paramname">p</td><td>binary predicate to compare the elements </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool </dd></dl>

</div>
</div>
<a id="af9a01fcb79e7a69b707081c1c17f361c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af9a01fcb79e7a69b707081c1c17f361c">&#9670;&nbsp;</a></span>fill()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::fill </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>value</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Fills the range with the value</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">value</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a761aa9f3bd88f019c46fe6cece93ade2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a761aa9f3bd88f019c46fe6cece93ade2">&#9670;&nbsp;</a></span>find()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">InputIt nc::stl_algorithms::find </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>value</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns the first element in the range [first, last) that satisfies specific criteria:</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">value</td><td>the value to find </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>InputIt </dd></dl>

</div>
</div>
<a id="a734698435eabdbc5bdf93b195d7fb6a7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a734698435eabdbc5bdf93b195d7fb6a7">&#9670;&nbsp;</a></span>for_each()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class UnaryFunction &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::for_each </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">UnaryFunction&#160;</td>
          <td class="paramname"><em>f</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Runs the function on each element of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">f</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="aca7862e3fe066fc65bf00cb7f5108e33"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aca7862e3fe066fc65bf00cb7f5108e33">&#9670;&nbsp;</a></span>is_sorted() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::is_sorted </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns true if the array is sorted</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool true if sorted </dd></dl>

</div>
</div>
<a id="a1f71dfda5f16d8a53c16260c5fa8fbdc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f71dfda5f16d8a53c16260c5fa8fbdc">&#9670;&nbsp;</a></span>is_sorted() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::is_sorted </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns true if the array is sorted</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool true if sorted </dd></dl>

</div>
</div>
<a id="a334cd50f7f10f689f82fa2ba7c5d88b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a334cd50f7f10f689f82fa2ba7c5d88b2">&#9670;&nbsp;</a></span>max_element() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">ForwardIt nc::stl_algorithms::max_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns the maximum element of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ForwordIt </dd></dl>

</div>
</div>
<a id="a282a4146afe33e4abb012e5c6b332948"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a282a4146afe33e4abb012e5c6b332948">&#9670;&nbsp;</a></span>max_element() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">ForwardIt nc::stl_algorithms::max_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns the maximum element of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ForwordIt </dd></dl>

</div>
</div>
<a id="af6291d1011c61c416134bc28def6f3ac"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af6291d1011c61c416134bc28def6f3ac">&#9670;&nbsp;</a></span>min_element() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">ForwardIt nc::stl_algorithms::min_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns the minimum element of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ForwardIt </dd></dl>

</div>
</div>
<a id="acb252e962fc7cedee9f4257453480d2b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acb252e962fc7cedee9f4257453480d2b">&#9670;&nbsp;</a></span>min_element() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">ForwardIt nc::stl_algorithms::min_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Returns the minimum element of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>ForwordIt </dd></dl>

</div>
</div>
<a id="a919ee9141ca95be989ad9b872a7ebd27"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a919ee9141ca95be989ad9b872a7ebd27">&#9670;&nbsp;</a></span>minmax_element() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::pair&lt;ForwardIt, ForwardIt&gt; nc::stl_algorithms::minmax_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Runs the minimum and maximum elements of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>std::pair </dd></dl>

</div>
</div>
<a id="ae1007b77aafe5a99b4952d9a8d8307af"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae1007b77aafe5a99b4952d9a8d8307af">&#9670;&nbsp;</a></span>minmax_element() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">std::pair&lt;ForwardIt, ForwardIt&gt; nc::stl_algorithms::minmax_element </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Runs the minimum and maximum elements of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>std::pair </dd></dl>

</div>
</div>
<a id="a2804ccb14980f96c7680838adc3b2762"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2804ccb14980f96c7680838adc3b2762">&#9670;&nbsp;</a></span>none_of()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class UnaryPredicate &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool nc::stl_algorithms::none_of </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">UnaryPredicate&#160;</td>
          <td class="paramname"><em>p</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Tests if none of the elements of a range satisy a predicate</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">p</td><td>unary predicate function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>bool </dd></dl>

</div>
</div>
<a id="af5ef45ab7814938799020ad24358b734"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af5ef45ab7814938799020ad24358b734">&#9670;&nbsp;</a></span>nth_element() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::nth_element </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>nth</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts up to the nth element</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the range </td></tr>
    <tr><td class="paramname">nth</td><td>the element that should be sorted </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the range </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a9928869b550b082898709c5671936079"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9928869b550b082898709c5671936079">&#9670;&nbsp;</a></span>nth_element() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::nth_element </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>nth</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts up to the nth element</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the range </td></tr>
    <tr><td class="paramname">nth</td><td>the element that should be sorted </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the range </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="aa8d46043c9c62a348687ef8aa0a3286b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8d46043c9c62a348687ef8aa0a3286b">&#9670;&nbsp;</a></span>replace()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt , class T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::replace </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>oldValue</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T &amp;&#160;</td>
          <td class="paramname"><em>newValue</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>replaces a value in the range with another value</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">oldValue</td><td>the value to replace </td></tr>
    <tr><td class="paramname">newValue</td><td>the replacement value </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a5334750b4a1bb38d3932bffcc32a71b4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5334750b4a1bb38d3932bffcc32a71b4">&#9670;&nbsp;</a></span>reverse()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BidirIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::reverse </td>
          <td>(</td>
          <td class="paramtype">BidirIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">BidirIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>reverses the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="acfc1538e29a04fe5158405c710e5eaa7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acfc1538e29a04fe5158405c710e5eaa7">&#9670;&nbsp;</a></span>rotate()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class ForwardIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::rotate </td>
          <td>(</td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>firstN</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">ForwardIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Rotates the elements of a range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the range </td></tr>
    <tr><td class="paramname">firstN</td><td>the element that should appear at the beginning of the rotated range </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the range </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a8cc83e2fb7a3d8302db0f4b19513ddd9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8cc83e2fb7a3d8302db0f4b19513ddd9">&#9670;&nbsp;</a></span>set_difference() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_difference </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>finds the difference of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a8a145ff0f4cf32b64e7464347d1ea9b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8a145ff0f4cf32b64e7464347d1ea9b2">&#9670;&nbsp;</a></span>set_difference() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_difference </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>finds the difference of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
    <tr><td class="paramname">comp</td><td>comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="aa8ff8c5bb6003ff0f02a17deb4ced8e2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8ff8c5bb6003ff0f02a17deb4ced8e2">&#9670;&nbsp;</a></span>set_intersection() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_intersection </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>finds the intersection of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="ad9a963ad13c86117f01fe2960525e074"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9a963ad13c86117f01fe2960525e074">&#9670;&nbsp;</a></span>set_intersection() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_intersection </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>finds the intersection of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
    <tr><td class="paramname">comp</td><td>comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a273ff7212f84bcd8de30e83ab0ae3bd1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a273ff7212f84bcd8de30e83ab0ae3bd1">&#9670;&nbsp;</a></span>set_union() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_union </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>finds the union of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a33da2f830ebf2e7c04f1ac94e1ad20b7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a33da2f830ebf2e7c04f1ac94e1ad20b7">&#9670;&nbsp;</a></span>set_union() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::set_union </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>last2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>finds the union of two ranges</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">last2</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">destination</td><td>the function to apply to the input iterators </td></tr>
    <tr><td class="paramname">comp</td><td>comparitor function </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a1d75d47f198fcc3693e87806d6ea8715"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1d75d47f198fcc3693e87806d6ea8715">&#9670;&nbsp;</a></span>sort() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::sort </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a519432fa55645fab8162c354e387b1a6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a519432fa55645fab8162c354e387b1a6">&#9670;&nbsp;</a></span>sort() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::sort </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a3b9f4bb9ba9a3ea8d8f97258eaa732d9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3b9f4bb9ba9a3ea8d8f97258eaa732d9">&#9670;&nbsp;</a></span>stable_sort() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::stable_sort </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts the range preserving order</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a7b2c4b6a3ef5cc55ebdae2aa757d1874"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7b2c4b6a3ef5cc55ebdae2aa757d1874">&#9670;&nbsp;</a></span>stable_sort() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class RandomIt , class Compare &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void nc::stl_algorithms::stable_sort </td>
          <td>(</td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">RandomIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">Compare&#160;</td>
          <td class="paramname"><em>comp</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Sorts the range preserving order</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">comp</td><td>the comparitor function </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a id="a616d5dabd547326285946d0014361ab4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a616d5dabd547326285946d0014361ab4">&#9670;&nbsp;</a></span>transform() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class OutputIt , class UnaryOperation &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::transform </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">UnaryOperation&#160;</td>
          <td class="paramname"><em>unaryFunction</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Transforms the elements of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">destination</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">unaryFunction</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="af358fec5563ae500162b310fe263a36d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af358fec5563ae500162b310fe263a36d">&#9670;&nbsp;</a></span>transform() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt1 , class InputIt2 , class OutputIt , class BinaryOperation &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">OutputIt nc::stl_algorithms::transform </td>
          <td>(</td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>first1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt1&#160;</td>
          <td class="paramname"><em>last1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt2&#160;</td>
          <td class="paramname"><em>first2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">BinaryOperation&#160;</td>
          <td class="paramname"><em>unaryFunction</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>Transforms the elements of the range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first1</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last1</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">first2</td><td>the first iterator of the second source </td></tr>
    <tr><td class="paramname">destination</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">unaryFunction</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="a7cec030870d1f3b4d1c7caf26c8d907d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7cec030870d1f3b4d1c7caf26c8d907d">&#9670;&nbsp;</a></span>unique_copy() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class OutputIt &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">constexpr OutputIt nc::stl_algorithms::unique_copy </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">constexpr</span><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Copies the unique elements of a range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">destination</td><td>the first iterator of the destination </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
<a id="aefa150cdbb6a1110c2164a3970a317a8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aefa150cdbb6a1110c2164a3970a317a8">&#9670;&nbsp;</a></span>unique_copy() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class InputIt , class OutputIt , class BinaryPredicate &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">constexpr OutputIt nc::stl_algorithms::unique_copy </td>
          <td>(</td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">InputIt&#160;</td>
          <td class="paramname"><em>last</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OutputIt&#160;</td>
          <td class="paramname"><em>destination</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">BinaryPredicate&#160;</td>
          <td class="paramname"><em>binaryFunction</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">constexpr</span><span class="mlabel">noexcept</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Copies the unique elements of a range</p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">first</td><td>the first iterator of the source </td></tr>
    <tr><td class="paramname">last</td><td>the last iterator of the source </td></tr>
    <tr><td class="paramname">destination</td><td>the first iterator of the destination </td></tr>
    <tr><td class="paramname">binaryFunction</td><td>the function to apply to the input iterators </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>OutputIt </dd></dl>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespacenc.html">nc</a></li><li class="navelem"><a class="el" href="namespacenc_1_1stl__algorithms.html">stl_algorithms</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.17 </li>
  </ul>
</div>
</body>
</html>
